All maximal-pairs in step-leap representation of melodic sequence

نویسندگان

  • Emilios Cambouropoulos
  • Maxime Crochemore
  • Costas S. Iliopoulos
  • Manal Mohamed
  • Marie-France Sagot
چکیده

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special ‘‘binary don’t care’’ symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established ‘‘step–leap’’ representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. 1⁄4 s, 1⁄4 l and # 1⁄4 s, # 1⁄4 l. We propose an Oðnþ dðn dÞ þ zÞ-time algorithm for computing all maximal-pairs in a given sequence x 1⁄4 x1⁄21::n , where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs. 2006 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step-leap” representation is examined. ...

متن کامل

A study on some properties of leap graphs

In a graph G, the first and second degrees of a vertex v is equal to thenumber of their first and second neighbors and are denoted by d(v/G) andd 2 (v/G), respectively. The first, second and third leap Zagreb indices are thesum of squares of second degrees of vertices of G, the sum of products of second degrees of pairs of adjacent vertices in G and the sum of products of firs...

متن کامل

Distinguished positive regular representations

Let $G$ be a tamely ramified reductive $p$-adic‎ ‎group‎. ‎We study distinction of a class of irreducible admissible representations‎ ‎of $G$ by the group of fixed points $H$ of an involution‎ ‎of $G$‎. ‎The representations correspond to $G$-conjugacy classes of‎ ‎pairs $(T,phi)$‎, ‎where $T$ is a‎ ‎tamely ramified maximal torus of $G$ and $phi$ is a quasicharacter‎ ‎of $T$ whose restriction t...

متن کامل

On leap Zagreb indices of graphs

The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.

متن کامل

ON THE USE OF KULSHAMMER TYPE INVARIANTS IN REPRESENTATION THEORY

Since 2005 a new powerful invariant of an algebra has emerged using the earlier work of Horvath, Hethelyi, Kulshammer and Murray. The authors studied Morita invariance of a sequence of ideals of the center of a nite dimensional algebra over a eld of nite characteristic. It was shown that the sequence of ideals is actually a derived invariant, and most recently a slightly modied version o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Sci.

دوره 177  شماره 

صفحات  -

تاریخ انتشار 2007